منابع مشابه
StUSPACE(log n) <= DSPACE(log²n / log log n)
We present a deterministic algorithm running in space O ? log 2 n= log logn solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(logn) time-bounded algorithm for this problem running on a parallel pointer machine.
متن کاملThe log-log LMS algorithm
This paper describes a new variant of the least-mean-squares (LMS) algorithm, with low computational complexity, for updating an adaptive lter. The reduction in complexity is obtained by using values of the input data and the output error, quantized to the nearest power of two, to compute the gradient. This eliminates the need for multipliers or shifters in the algorithm's update section. The q...
متن کاملRuspace(log N) Dspace(log 2 N= Log Log N) 1
We present a deterministic algorithm running in space O log2 n= log log n solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(log n) time-bounded algorithm for this problem running on a parallel pointer machine.
متن کاملColoring Triangle-Free Rectangle Overlap Graphs with $$O(\log \log n)$$ O ( log log n ) Colors
Recently, Pawlik et al. have shown that triangle-free intersection graphs of line segments in the plane can have arbitrarily large chromatic number. Specifically, they construct triangle-free segment intersection graphs with chromatic number Θ(log log n). Essentially the same construction produces Θ(log log n)-chromatic triangle-free intersection graphs of a variety of other geometric shapes—th...
متن کاملLog Abelian Varieties over a Log Point
We study (weak) log abelian varieties with constant degeneration in the log flat topology. If the base is a log point, we further study the endomorphism algebras of log abelian varieties. In particular, we prove the dual short exact sequence for isogenies, Poincaré complete reducibility theorem for log abelian varieties, and the semisimplicity of the endomorphism algebras of log abelian varieti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Navigation
سال: 1956
ISSN: 0373-4633,1469-7785
DOI: 10.1017/s0373463300036778